package com.wchinasofit.lianxi;

public class Demo {
    public int[] rs(int[]arr) {
        int sum = 0;
        int max=arr[0];
        int min=arr[0];
        for (int i = 0; i <arr.length ; i++) {
        if(max<arr[i]){
            max=arr[i];
        }
        if(min<arr[i]){
            min=arr[i];
        }
        sum=sum+arr[i];
        }
        int count = sum/arr.length;
        int [] Myzhi = {max ,min,count} ;
        return  Myzhi;
    }
}
